منابع مشابه
Bottleneck Domination and Bottleneck Independent Domination on Graphs
In this paper, the bottleneck dominating set problem and one of its variants, the bottleneck independent dominating set problem, are considered. Let G(V, E, W) denote a graph with n-vertex-set V and m-edge-set E, where each vertex v is associated with a real cost W(v). Given any subset V′ of V, the bottleneck cost of V′ is defined as max{W(x) x ∈ V′}. The major task involves identifying a dom...
متن کاملAccounting History and Accounting Progress
A. C. Littleton famously described accounting as “relative and progressive”. However, in recent historical accounting research, there has been increasing hesitation in describing accounting as “progressing”. This is largely because “progress” implies a degree not only of change but also of improvement, and historical accounting researchers, influenced by social science conventions, often regard...
متن کاملInformation Bottleneck Co-clustering
Co-clustering has emerged as an important approach for mining contingency data matrices. We present a novel approach to co-clustering based on the Information Bottleneck principle, called Information Bottleneck Co-clustering (IBCC), which supports both soft-partition and hardpartition co-clusterings, and leverages an annealing-style strategy to bypass local optima. Existing co-clustering method...
متن کاملGetting through the bottleneck
The first positive trend is the slowing of global population growth. There is a significant shift in global fertility that will enable us at least to think about moving to a world of near stable populations within a century, maybe sooner. Fertility in about 40 per cent of the world’s countries is now below the replacement rate. Another 40 per cent are experiencing continued downward movement of...
متن کاملThe graph bottleneck identity
A matrix S = (sij) ∈ R n×n is said to determine a transitional measure for a digraph Γ on n vertices if for all i, j, k ∈ {1, . . . , n}, the transition inequality sij sjk ≤ sik sjj holds and reduces to the equality (called the graph bottleneck identity) if and only if every path in Γ from i to k contains j. We show that every positive transitional measure produces a distance by means of a loga...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Maandblad Voor Accountancy en Bedrijfseconomie
سال: 2011
ISSN: 2543-1684,0924-6304
DOI: 10.5117/mab.85.17803